A Θ(n) Bound-Consistency Algorithm for the Increasing Sum Constraint
نویسندگان
چکیده
Given a sequence of variables X = 〈x0, x1, . . . , xn−1〉, we consider the IncreasingSum constraint, which imposes ∀i ∈ [0, n − 2] xi ≤ xi+1, and ∑ xi∈X xi = s. We propose an Θ(n) bound-consistency algorithm for IncreasingSum.
منابع مشابه
An O(nlog n) Bound Consistency Algorithm for the Conjunction of an alldifferent and an Inequality between a Sum of Variables and a Constant, and its Generalization
This paper gives an O(n log n) bound-consistency filtering algorithm for the conjunction alldifferent(V0, V1, . . . , Vn−1) ∧ f(V0)⊕ f(V1)⊕ · · · ⊕ f(Vn−1) ≤ cst , (V0, V1, . . . , Vn−1, cst ∈ N ), where (N,⊕) is a commutative group, f is a unary function, and both ⊕ and f are monotone increasing. This complexity is equal to the complexity of the bound-consistency algorithm of the alldifferent ...
متن کاملA new method for 3-D magnetic data inversion with physical bound
Inversion of magnetic data is an important step towards interpretation of the practical data. Smooth inversion is a common technique for the inversion of data. Physical bound constraint can improve the solution to the magnetic inverse problem. However, how to introduce the bound constraint into the inversion procedure is important. Imposing bound constraint makes the magnetic data inversion a n...
متن کاملSum-Rate Maximization Based on Power Constraints for Cooperative AF Relay Networks
In this paper, our objective is maximizing total sum-rate subject to power constraints on total relay transmit power or individual relay powers, for amplify-and-forward single-antenna relay-based wireless communication networks. We derive a closed-form solution for the total power constraint optimization problem and show that the individual relay power constraints optimization problem is a quad...
متن کاملFaster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
We present narrowing algorithms for the sortedness and the alldifferent constraint which achieve bound-consistency. The algorithm for the sortedness constraint takes as input 2n intervals X1, . . . , Xn, Y1, . . . , Yn from a linearly ordered set D. Let S denote the set of all tuples t ∈ X1 × · · · × Xn × Y1 × · · · × Yn such that the last n components of t are obtained by sorting the first n c...
متن کاملBound Consistency on Linear Constraints in Finite Domain Constraint
This paper discusses the complexity of bound consistency on n-ary linear constraint system and investigates the relationship between equivalent binary equation systems from the perspective of bound consistency techniques. We propose an efficient bound consistency enforcing algorithm whose complexity is .In addition, by transforming a binary equation system into solved form, an efficient consist...
متن کامل